Maintaining dynamic sequences under equality tests in polylogarithmic time
نویسندگان
چکیده
منابع مشابه
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time1
We present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log2 n) expected time where n is the length of the seque...
متن کاملDynamic graph connectivity in polylogarithmic worst case time
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence of edge insertions and deletions, answer queries of the form q(a, b): “Is there a path between nodes a and b?” While data structures for this problem with polylogarithmic amortized time per operation have been known since the mid-1990’s, these data structures have Θ(n)...
متن کاملMaintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
A sparse subgraph G′ of G is called a matching sparsifier if the size or weight of matching in G′ is approximately equal to the size or weight of maximum matching in G. Recently, algorithms have been developed to find matching sparsifiers in a static bipartite graph. In this paper, we show that we can find matching sparsifier even in an incremental bipartite graph. This observation leads to fol...
متن کاملPolylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computa...
متن کاملMaintaining High-Bandwidth Under Dynamic Network Conditions
The need to distribute large files across multiple wide-area sites is becoming increasingly common, for instance, in support of scientific computing, configuring distributed systems, distributing software updates such as open source ISOs or Windows patches, or disseminating multimedia content. Recently a number of techniques have been proposed for simultaneously retrieving portions of a file fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1997
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf02522825